Upper and lower bounds in limit analysis: Adaptive meshing strategies and discontinuous loading
نویسندگان
چکیده
منابع مشابه
Upper and lower bounds in limit analysis: Adaptive meshing strategies and discontinuous loading
Upper and lower bounds of the collapse load factor are here obtained as the optimum values of two discrete constrained optimization problems. The membership constraints for VonMises and Mohr–Coulomb plasticity criteria are written as a set of quadratic constraints, which permits one to solve the optimization problem using specific algorithms for Second-Order Conic Program (SOCP). From the stres...
متن کاملMesh adaptive computation of upper and lower bounds in limit analysis
An efficient procedure to compute strict upper and lower bounds for the exact collapse multiplier in limit analysis is presented, with a formulation that explicitly considers the exact convex yield condition. The approach consists of two main steps. First, the continuous problem, under the form of the static principle of limit analysis, is discretized twice (one per bound) using particularly ch...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملUpper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملLower Bounds and Upper Bounds for MaxSAT
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is init...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Numerical Methods in Engineering
سال: 2009
ISSN: 0029-5981,1097-0207
DOI: 10.1002/nme.2421